منابع مشابه
Engel Graph Associated with a Group
Let G be a non-Engel group and let L(G) be the set of all left Engel elements of G. Associate with G a graph EG as follows: Take G\L(G) as vertices of EG and join two distinct vertices x and y whenever [x,k y] 6= 1 and [y,k x] 6= 1 for all positive integers k. We call EG, the Engel graph of G. In this paper we study the graph theoretical properties of EG.
متن کاملNon-cyclic Graph Associated with a Group
We associate a graph CG to a non locally cyclic group G (called the non-cyclic graph of G) as follows: take G\Cyc(G) as vertex set, where Cyc(G) = {x ∈ G | 〈x, y〉 is cyclic for all y ∈ G} is called the cyclicizer of G, and join two vertices if they do not generate a cyclic subgroup. For a simple graph Γ, w(Γ) denotes the clique number of Γ, which is the maximum size (if it exists) of a complete...
متن کاملGroup Rings with Solvable «-engel Unit Groups'
Let KG be the group ring of a group G over a field of characteristic p > 0, p ^ 2, 3. Suppose G contains no element of order p (if p > 0). Group algebras KG with unit group U(KG) solvable and n-Engel are characterized. Let ATG be the group ring of a group G over a field K of characteristic p > 0 and let U(KG) denote its group of units. Several authors including Bateman [1], Bateman and Coleman ...
متن کاملGroup rings satisfying generalized Engel conditions
Let R be a commutative ring with unity of characteristic r≥0 and G be a locally finite group. For each x and y in the group ring RG define [x,y]=xy-yx and inductively via [x ,_( n+1) y]=[[x ,_( n) y] , y]. In this paper we show that necessary and sufficient conditions for RG to satisfies [x^m(x,y) ,_( n(x,y)) y]=0 is: 1) if r is a power of a prime p, then G is a locally nilpotent group an...
متن کاملEngel quasigroups associated with cycle systems
Many authors have studied methods of generalising Steiner quasigroups by using certain cycle systems. The usual aims have been to preserve the law (xy)y = x, by using the standard construction, or to preserve the law xy = yx, by using the opposite vertex construction. In this paper we seek to generalise the law (xy)y = x to laws of the form ( ... (xy)y . . . )y = x and (y( ... (y(yx)) ... ) = x...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2007
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2007.09.007